Secured Efficient Data Access in Cloud Architecture with B+ Tree Algorithm

Cloud computing facilitates data protection, privacy and medical record access. Computing is the new trend to reduce the investment in business to satisfy the client needs using internet. The various cloud services provides infrastructure, software and platform. In cloud computing, data is moved to a remote location. Users store their data conscientiously in the cloud and return back when it is needed. But there is no assurance for the data stored in the cloud is secure and not changed by the cloud or Third Party Auditor (TPA).Cloud storage architecture will have a collection of storage servers with higher end configuration which will provides long-term storage services over the Internet and also for the cloud storage system. Here storing and retrieving the data in a third party’s cloud system causes serious problems and conflict over data confidentiality during the data transactions. Whenever third party storage will involved with the cloud server this conflict will occur naturally. But general encryption processor and verifier schemes protect data confidentiality during the transaction of dual execution. In this paper, we propose a secured threshold proxy re-encryption server and integrate it with a decentralized erasure code such that a secure distributed storage system is formulated. The main technical contribution is that the proxy re-encryption scheme supports encoding operations along with a key over encrypted messages and forwarding operations over encoded and encrypted messages. This method is implemented for secured data forwarding. During data forwarding a proxy server will be created virtually to access the encrypted data from the sender side. This makes less traffic and the original data content will not get affected during the time of data transaction. After the transaction the proxy server will be deleted. In this paper, an enhanced method for accessing the user data by B+ tree is proposed. With the help of B++ tree algorithm, the TPA will access the data at the CSP of the time complexity of O (log n). In turn, the user can access their data in an efficient manner.